perfect shuffle

perfect shuffle
совершенное тасование (разновидность перестановки).

English-Russian cryptological dictionary . 2014.

Игры ⚽ Поможем написать курсовую

Смотреть что такое "perfect shuffle" в других словарях:

  • Faro shuffle — The faro shuffle is a method of shuffling playing cards.In a perfect shuffle or perfect faro shuffle, the deck is split into equal halves of 26 cards which are then pushed together in a certain way so as to make them perfectly interweave. The… …   Wikipedia

  • Out shuffle — An out shuffle is a type of perfect shuffle done in two steps: Split the cards exactly in half (a bottom half and a top half) and then Interweave each half of the deck such that every other card came from the same half of the deck. If this… …   Wikipedia

  • In shuffle — An in shuffle is a type of perfect shuffle done in two steps: #Split the cards exactly in half (a bottom half and a top half) and then #Interweave each half of the deck such that every other card came from the same half of the deck. If this… …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

  • Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

  • Omega network — An Omega network is a network configuration often used in parallel computing architectures. It is an indirect topology that relies on the perfect shuffle interconnection algorithm. Omega network with 8 processing elements Contents …   Wikipedia

  • Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 …   Wikipedia

  • Verbindungsnetzwerk — Ein Verbindungsnetzwerk beschreibt eine technische Einrichtung, die die Aufgabe hat, eine statische oder dynamische Verbindung zwischen einem Sender und einem Empfänger über ein entsprechendes Leitungsmedium herzustellen, um eine… …   Deutsch Wikipedia

  • Random permutation — A random permutation is a random ordering of a set of objects, that is, a permutation valued random variable. The use of random permutations is often fundamental to fields that use randomized algorithms. Such fields include coding theory,… …   Wikipedia

  • Classification of Clifford algebras — In mathematics, in particular in the theory of nondegenerate quadratic forms on real and complex vector spaces, the finite dimensional Clifford algebras have been completely classified in terms of isomorphisms that preserve the Clifford product.… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»